Low-Complexity Optimal Hard Decision Fusion Under the Neyman–Pearson Criterion

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generalized Optimal Hard Decision Fusion

In this letter we formulate a generalized decision fusion problem (GDFP) for sensing with centralized hard decision fusion. We show that various new and existing decision fusion rules are special cases of the proposed GDFP. We then relate our problem to the classical 0 − 1 Knapsack problem (KP). Consequently, we apply dynamic programming to solve the exponentially complex GDFP in polynomial tim...

متن کامل

VLSI Architecture of Configurable Low Complexity Hard Decision Viterbi Decoder

A Viterbi algorithm has served as a powerful method for decoding of the convolutional code so as to control errors in data transmission over a noisy channel. It is based on maximum likelihood algorithm for decoding the data. However, the hardware implementation of Viterbi algorithm become crucial as it consumes large resources due to its complexity. This paper discusses the implementation of an...

متن کامل

Low Complexity Algorithm for Optimal Hard Decoding of Convolutional Codes

It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...

متن کامل

Optimal Detection under the Restricted Bayesian Criterion

This paper aims to find a suitable decision rule for a binary composite hypothesis-testing problem with a partial or coarse prior distribution. To alleviate the negative impact of the information uncertainty, a constraint is considered that the maximum conditional risk cannot be greater than a predefined value. Therefore, the objective of this paper becomes to find the optimal decision rule to ...

متن کامل

Optimal Distributed Decision Fusion

Follow this and additional works at: http://opensiuc.lib.siu.edu/ece_articles Published Thomopoulos, S.C.A., Viswanathan, R., & Bougoulias, D.K. (1989). Optimal distributed decision fusion. IEEE Transactions on Aerospace and Electronic Systems, 25(5), 761-765. doi: 10.1109/7.42092 ©1989 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Signal Processing Letters

سال: 2018

ISSN: 1070-9908,1558-2361

DOI: 10.1109/lsp.2017.2766245